Computable functions of reals
نویسندگان
چکیده
We introduce a new notion of computable function on R and prove some basic properties. We give two applications, first a short proof of Yoshinaga’s theorem that periods are elementary (they are actually lower elementary). We also show that the lower elementary complex numbers form an algebraically closed field closed under exponentiation and some other special functions.
منابع مشابه
Divergence bounded computable real numbers
A real x is called h-bounded computable, for some function h : N → N, if there is a computable sequence (xs) of rational numbers which converges to x such that, for any n ∈ N, at most h(n) non-overlapping pairs of its members are separated by a distance larger than 2−n. In this paper we discuss properties of h-bounded computable reals for various functions h. We will show a simple sufficient co...
متن کاملImplicit complexity in recursive analysis
Recursive analysis is a model of analog computation which is based on type 2 Turing machines. Various classes of functions computable in recursive analysis have recently been characterized in a machine independent and algebraical context. In particular nice connections between the class of computable functions (and some of its sub and supclasses) over the reals and algebraically defined (suband...
متن کاملAlgebraic Characterization of Complexity Classes of Computable Real Functions
Several algebraic machine-independant characterizations of computable functions over the reals have been obtained recently. In particular nice connections between the class of computable functions (and some of its sub and sup-classes) over the reals and algebraically defined (suband sup-) classes of R-recursive functions à la Moore 96 have been obtained. We provide in this paper a framework tha...
متن کاملA Hierarchy of Turing Degrees for Divergence Bounded Computable Real Numbers
A real number x is f-bounded computable (f-bc, for short) for a function f if there is a computable sequence (xs) of rational numbers which converges to x f-bounded effectively in the sense that, for any natural number n, the sequence (xs) has at most f (n) non-overlapping jumps of size larger than 2−n. f-bc reals are called divergence bounded computable if f is computable. In this paper we giv...
متن کاملReal Recursive Functions and Real Extensions of Recursive Functions
Recently, functions over the reals that extend elementarily computable functions over the integers have been proved to correspond to the smallest class of real functions containing some basic functions and closed by composition and linear integration. We extend this result to all computable functions: functions over the reals that extend total recursive functions over the integers are proved to...
متن کاملRandom reals à la Chaitin with or without prefix-freeness
We give a general theorem that provides examples of n-random reals à la Chaitin, for every n ≥ 1; these are halting probabilities of partial computable functions that are universal by adjunction for the class of all partial computable functions, The same result holds for the class functions of partial computable functions with prefix-free domain. Thus, the usual technical requirement of prefix-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009